Improving quality of graph partitioning using multilevel optimization
نویسندگان
چکیده
منابع مشابه
Multilevel Graph Partitioning Schemes
In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In p...
متن کاملParallel Multilevel Graph Partitioning
In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm achieves a speedup of up to 56 on a 128-processorCray T3D for moderate size problems, further reducing its already moderate serial run time. Graphs with over 200,000 vertices can be partitioned in 128 p...
متن کاملQuality matching and local improvement for multilevel graph-partitioning
Multilevel strategies have proven to be very powerful approaches in order to partition graphs eeciently. Their eeciency is dominated by two parts; the coarsening and the local improvement strategies. Several methods have been developed to solve these problems, but their eeciency has only been proven on an experimental basis. In this paper we present new and eecient methods for both problems, wh...
متن کاملEngineering Multilevel Graph Partitioning Algorithms
We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on max-flow min-cut computations and more localized FM searches. By combining these techniques, we obtain an algorithm that is fast on the one hand and on the other hand is able to improve th...
متن کاملSerial and Parallel Multilevel Graph Partitioning Using Fixed Centers
We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of RAS
سال: 2014
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2014-26(4)-2